//#define  _CRT_SECURE_NO_WARNINGS 1
//#include<stdio.h>
//#include<stdlib.h>
////void rotate(int* nums, int numsSize, int k) 
////{
////	int left = 0, right = numsSize - 1;
////	while (left<=right)
////	{
////		int tmp = nums[left];
////		nums[left] = nums[right];
////		nums[right] = tmp;
////		left++;
////		right--;
////	}
////}
////void reverse(int* nums,int numsSize,int k)
////{
////	if (k > numsSize)
////	{
////		k = k % numsSize;
////	}
////	rotate(nums, numsSize, k);
////	rotate(nums, k, k);
////	rotate(nums, numsSize - k, numsSize - k);
////}
////int main()
////{
////	int nums[] = { 1,2,3,4,5,6,7,3 };
////	int size = sizeof(nums) / sizeof(nums[0]);
////	return 0;
////}
////void rotate(int* nums, int numsSize, int k)
////{
////    int arr[20] = { 0 };
////    int left = 0, right = numsSize - k;
////    int ret = 0;
////    while (right < numsSize)
////    {
////        arr[ret++] = nums[right++];
////        if (right = numsSize  )
////        {
////            if (left<numsSize-k)
////            {
////                arr[ret++] = nums[left++];                    
////            }
////        }
////    }
////}
////int main()
////{
////    int arr[] = { 1,2,3,4,5,6,7 };
////    int size = sizeof(arr) / sizeof(arr[0]);
////    int k = 0;
////    scanf("%d", &k);
////    rotate(arr, size, k);
////    for (int i = 0; i < size; i++)
////    {
////        printf("%d ", arr[i]);
////    }
////    printf("\n");
////    return 0;
////}
////void rotate(int* nums, int numsSize, int k)
////{
////	int arr[20] = { 0 };
////	for (int i=0;i<numsSize;i++)
////	{
////		arr[(i + k + 1) % numsSize] = nums[i];
////	}
////	for (int i = 0;i < numsSize; i++)
////	{
////		nums[i] = arr[i];
////	}
////}
//int removeDuplicates(int* nums, int numsSize) 
//{
//	int left = 0, right = 1;
//	while (right < numsSize)
//	{
//		if (nums[left] != nums[right])
//		{
//			nums[++left] = nums[right++];
//		}
//		else
//		{
//			right++;
//		}
//	}
//	return left;
//}